Computation and Maintenance of Visibility and Shadows in the Plane
نویسنده
چکیده
We consider visibility and shadow problems in the plane under static and dynamic conditions. We show that several problems in this domain are intimately related and that a careful formulation of the requirements of each problem can lead to a great deal of reuse in the implementation. This is of interest to the practitioner who may find it difficult to implement visibility and shadow algorithms given their complexity. A solution of these problems in the plane turns out to be a necessary component of their solution in space and by separating these components, difficult issues of implementation are taken care of at the design level. We also give specific algorithmic results. We show a reduction between shadow and visibility computations under a point light source, between static and dynamic computations under a point light source, and visibility and shadow computations between a point and a linear light source.
منابع مشابه
A Geometric Framework for Computer Graphics Addressing Modeling
A Geometric Framework for Computer Graphics Addressing Modeling, Visibility, and Shadows Sherif Ghali Doctor of Philosophy Graduate Department of Computer Science University of Toronto 1999 The main question this dissertation addresses is the following: Is it possible to design a computer graphics API such that modeling primitives, computing visibility, and generating shadows from point, linear...
متن کاملTechnical Report Lazy visibility evaluation for exact soft shadows
This report presents a novel approach to compute high quality and alias-free soft shadows using exact visibility computations. This work relies on a theoritical framework allowing to group lines according to the geometry they intersect. From this study, we derive a new algorithm encoding lazily the visibility from a polygon. Contrary to previous works on from-polygon visibility, our approach is...
متن کاملEfficient Shadows from Sampled Environment Maps
This paper addresses the problem of efficiently calculating shadows from environment maps. Since accurate rendering of shadows from environment maps requires hundreds of lights, the expensive computation is determining visibility from each pixel to each light direction, such as by ray-tracing. We show that coherence in both spatial and angular domains can be used to reduce the number of shadow ...
متن کاملEfficient Shadows for Sampled Environment Maps
This paper addresses the problem of efficiently calculating shadows from environment maps in the context of ray-tracing. Since accurate rendering of shadows from environment maps requires hundreds of lights, the expensive computation is determining visibility from each pixel to each light direction. We show that coherence in both spatial and angular domains can be used to reduce the number of s...
متن کاملRemoving car shadows in video images using entropy and Euclidean distance features
Detecting car motion in video frames is one of the key subjects in computer vision society. In recent years, different approaches have been proposed to address this issue. One of the main challenges of developed image processing systems for car detection is their shadows. Car shadows change the appearance of them in a way that they might seem stitched to other neighboring cars. This study aims ...
متن کامل